Directed Feedback Vertex Set Problem is FPT
نویسندگان
چکیده
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long time open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)n) for it. As the feedback arc set problem in directed graph can be transformed to a feedback vertex set problem in directed graph, hence we also show that the parameterized feedback arc set problem can be solved in time of O((1.48k)n).
منابع مشابه
Directed Feedback Vertex Set is Fixed-Parameter Tractable
We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8k! ∗ poly(n)).
متن کاملExperimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
In this experimental study we evaluate the performance of a recent fixed parameter tractable (FPT) algorithm for the directed feedback node set problem (DFVS) by Chen et al. Lacking suitable real world data, all tests are performed on random graphs. To speed up the FPT algorithm we propose several new data reduction rules for DFVS, and then use various heuristics to accelerate the FPT search. O...
متن کاملAn O∗(2O(k)) FPT Algorithm for the Undirected Feedback Vertex Set Problem∗
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the number of vertices in the graph. This improves on the best previous FPT algorithms due to [RSS02, KPS04] and [RS05] that have running times of the form O ∗(2O(k lg lg ) and O∗(2O(k lg k lg lg k ), respe...
متن کاملAn improved FPT algorithm for Independent Feedback Vertex Set
We study the Independent Feedback Vertex Set problem — a variant of the classic Feedback Vertex Set problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex set S ⊆ V (G) such that G \ S is a forest and S is an independent set of size at most k. We present an O∗((1 +φ))-time FPT algorithm for this problem, where φ < 1.619 is the golden ratio, impro...
متن کاملA single - exponential FPT algorithm for the K 4 - minor cover problem ∗ Eun
Given an input graph G and an integer k, the parameterized K4-minor cover problem askswhether there is a set S of at most k vertices whose deletion results in a K4-minor-free graph,or equivalently in a graph of treewidth at most 2. This problem is inspired by two well-studiedparameterized vertex deletion problems, Vertex Cover and Feedback Vertex Set, whichcan also be expressed ...
متن کامل